Teaching Interactive Proofs to Mathematicians
نویسندگان
چکیده
منابع مشابه
Teaching statistics to medical undergraduates using interactive and participatory sessions
Introduction: In India, medical undergraduates think that statistics is difficultto understand. Often, it is taught just before final assessment examinationusing didactic lectures, with little use of medical examples and less focus onapplication. Hence, we prepared interactive, participatory sessions for teachingbiostatistics to medical undergraduate.Methods: The sessions were delivered by a fa...
متن کاملInteractive Coding for Interactive Proofs
We consider interactive proof systems over adversarial communication channels. We show that the seminal result that IP = PSPACE still holds when the communication channel is malicious, allowing even a constant fraction of the communication to be arbitrarily corrupted. Supported in part by NSF CNS 1413971 and NSF CCF 1423306. Partially supported by gifts from VMware Labs and Google, and NSF gran...
متن کاملIntroduction to Interactive Proofs & The Sumcheck Protocol
Traditional mathematical proofs are static objects: a prover P writes down a sequence of mathematical statements, and then at some later time a verifier V checks that these statements are consistent and correct. Over the years, computer science has changed the notion of a mathematical proof. The first such change was the observation that for all practical purposes, the verification procedure sh...
متن کاملInteractive Oracle Proofs
We initiate the study of a proof system model that naturally combines two well-known models: interactive proofs (IPs) and probabilistically-checkable proofs (PCPs). An interactive oracle proof (IOP) is an interactive proof in which the verifier is not required to read the prover’s messages in their entirety; rather, the verifier has oracle access to the prover’s messages, and may probabilistica...
متن کاملReal Interactive Proofs for VPSPACE
We study interactive proofs in the framework of real number complexity as introduced by Blum, Shub, and Smale. The ultimate goal is to give a Shamir like characterization of the real counterpart IPR of classical IP. Whereas classically Shamir’s result implies IP = PSPACE = PAT = PAR, in our framework a major difficulty arises from the fact that in contrast to Turing complexity theory the real n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2020
ISSN: 2075-2180
DOI: 10.4204/eptcs.328.1